Progressive skylining over Web-accessible databases

نویسندگان

  • Eric Lo
  • Kevin Y. Yip
  • King-Ip Lin
  • David Wai-Lok Cheung
چکیده

Skyline queries return a set of interesting data points that are not dominated on all dimensions by any other point. Most of the existing algorithms focus on skyline computation in centralized databases, and some of them can progressively return skyline points upon identification rather than all in a batch. Processing skyline queries over the Web is a more challenging task because in many Web applications, the target attributes are stored at different sites and can only be accessed through restricted external interfaces. In this paper, we develop PDS (progressive distributed skylining), a progressive algorithm that evaluates skyline queries efficiently in this setting. The algorithm is also able to estimate the percentage of skyline objects already retrieved, which is useful for users to monitor the progress of long running skyline queries. Our performance study shows that PDS is efficient and robust to different data distributions and achieves its progressive goal with a minimal overhead. 2005 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Distributed Skylining for Web Information Systems

Though skyline queries already have claimed their place in retrieval over central databases, their application in Web information systems up to now was impossible due to the distributed aspect of retrieval over Web sources. But due to the amount, variety and volatile nature of information accessible over the Internet extended query capabilities are crucial. We show how to efficiently perform di...

متن کامل

Supporting Skyline Queries on Categorical Data in Web Information Systems

Skyline queries enable more intuitive querying, essential for e.g. e-commerce applications. However, the performance of query execution will drastically deteriorate, if categorical data is involved. Unfortunately most Web data tends to be of exactly that nature. In this paper we show how to remedy the gap in current skylining algorithms and adapt them for the nature of Web data. Our innovative ...

متن کامل

QProber: A System for Automatic Classification of Hidden-Web Resources

The contents of many valuable web-accessible databases are only available through search interfaces and are hence invisible to traditional web “crawlers.” Recently, commercial web sites have started to manually organize web-accessible databases into Yahoo!-like hierarchical classification schemes. Here, we introduce QProber, a modular system that automates this classification process by using a...

متن کامل

Summarizing and Searching Hidden-Web Databases Hierarchically Using Focused Probes

Many valuable text databases on the web have non-crawlable contents that are “hidden” behind search interfaces. Metasearchers are helpful tools for searching over many such databases at once through a unified query interface. A critical task for a metasearcher to process a query efficiently and effectively is the selection of the most promising databases for the query, a task that typically rel...

متن کامل

Aggregate Estimation Over Dynamic Hidden Web Databases

Many databases on the web are “hidden” behind (i.e., accessible only through) their restrictive, form-like, search interfaces. Recent studies have shown that it is possible to estimate aggregate query answers over such hidden web databases by issuing a small number of carefully designed search queries through the restrictive web interface. A problem with these existing work, however, is that th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Data Knowl. Eng.

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2006